翻訳と辞書
Words near each other
・ DNAJA3
・ DNAJB1
・ DNAJB11
・ DNAJB2
・ DNAJB4
・ DNAJB6
・ DNAJB9
・ DNA bank
・ DNA barcoding
・ DNA base flipping
・ DNA beta-glucosyltransferase
・ DNA binding site
・ DNA Bioscience
・ DNA clamp
・ DNA codon table
DNA computing
・ DNA condensation
・ DNA construct
・ DNA damage (naturally occurring)
・ DNA damage checkpoint
・ DNA damage theory of aging
・ DNA damage-binding protein
・ DNA damage-inducible transcript 3
・ DNA Data Bank of Japan
・ DNA database
・ DNA day
・ DNA demethylation
・ DNA digital data storage
・ DNA disruptor
・ DNA extraction


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

DNA computing : ウィキペディア英語版
DNA computing

DNA computing is a branch of computing which uses DNA, biochemistry, and molecular biology hardware, instead of the traditional silicon-based computer technologies. DNA computing—or, more generally, biomolecular computing—is a fast-developing interdisciplinary area. Research and development in this area concerns theory, experiments, and applications of DNA computing. The term "molectronics" has sometimes been used, but this term had already been used for an earlier technology, a then-unsuccessful rival of the first integrated circuits;〔"Molectronic Computer Shown by Texas Instr.", unknown publication, circa 1963, in Box 2, Folder 3, listed in ''Jack Kilby Papers: A Guide to the Collection'', Southern Methodist University. ().〕 this term has also been used more generally, for molecular-scale technology.〔"Application-specific methods for testing molectronic or nanoscale devices" (filed April 1, 2004), Patent US 7219314 B1. () .〕
== History ==

This field was initially developed by Leonard Adleman of the University of Southern California, in 1994.〔 — The first DNA computing paper. Describes a solution for the directed Hamiltonian path problem. Also available here: ()〕 Adleman demonstrated a proof-of-concept use of DNA as a form of computation which solved the seven-point Hamiltonian path problem. Since the initial Adleman experiments, advances have been made and various Turing machines have been proven to be constructible.〔 — Describes a solution for the boolean satisfiability problem. Also available here: ()
〕〔
— Describes a solution for the bounded Post correspondence problem, a hard-on-average NP-complete problem. Also available here: ()〕
While the initial interest was in using this novel approach to tackle NP-hard problems, it was soon realized that they may not be best suited for this type of computation, and several proposals have been made to find a "killer application" for this approach. In 1997, computer scientist Mitsunori Ogihara working with biologist Animesh Ray suggested one to be the evaluation of Boolean circuits and described an implementation.〔M. Ogihara and A. Ray, ("Simulating Boolean circuits on a DNA computer" ).
Algorithmica 25:239–250, 1999.〕〔("In Just a Few Drops, A Breakthrough in Computing" ), ''New York Times'', May 21, 1997〕
In 2002, researchers from the Weizmann Institute of Science in Rehovot, Israel, unveiled a programmable molecular computing machine composed of enzymes and DNA molecules instead of silicon microchips. On April 28, 2004, Ehud Shapiro, Yaakov Benenson, Binyamin Gil, Uri Ben-Dor, and Rivka Adar at the Weizmann Institute announced in the journal Nature that they had constructed a DNA computer coupled with an input and output module which would theoretically be capable of diagnosing cancerous activity within a cell, and releasing an anti-cancer drug upon diagnosis.〔. Also available here: (An autonomous molecular computer for logical control of gene expression )〕
In January 2013, researchers were able to store a JPEG photograph, a set of Shakespearean sonnets, and an audio file of Martin Luther King, Jr.'s speech I Have a Dream on DNA digital data storage.〔(DNA stores poems, a photo and a speech | Science News )〕
In March 2013, researchers created a transcriptor (a biological transistor).

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「DNA computing」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.